[[Computing MOC]]
# Primitively recursive

A **primitively recursive** function is a function computable without unbounded loops. #m/def/computability
That is to say, all loops are **for loops** so that an upper bound is known for the number of times a loop will repeat whenever a loop is begun.


#
---
#state/develop | #lang/en | #SemBr